Multi-machine scheduling lower bounds using decision diagrams
نویسندگان
چکیده
منابع مشابه
Lower Bounds for Parallel Machine Scheduling Problems
We study the parallel machine scheduling problem with release dates and we consider several “min-sum” objective functions including total weighted tardiness, total tardiness, total weighted completion time and total completion time. We describe several lower bounds for these problems, most of them being original ones. We provide experimental results to compare these lower bounds according to th...
متن کاملLower Bounds for Smith's Rule in Stochastic Machine Scheduling
We consider the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. In a landmark paper from 1986, Kawaguchi and Kyan [5] showed that scheduling the jobs according to the WSPT rule –also known as Smith’s rule– has a performance guarantee of 1 2 (1 + √ 2) ≈ 1.207. They also gave an instance to show that this bound is tight. We consider the stoch...
متن کاملLower Bounds for On-Line Single-Machine Scheduling
The problem of scheduling jobs that arrive over time on a single machine is well-studied. We study the preemptive model and the model with restarts. We provide lower bounds for deterministic and randomized algorithms for several optimality criteria: weighted and unweighted total completion time, and weighted and unweighted total ow time. By using new techniques, we provide the rst lower bounds ...
متن کاملExponential Lower Bounds for Refuting Random Formulas Using Ordered Binary Decision Diagrams
A propositional proof system based on ordered binary decision diagrams (OBDDs) was introduced by Atserias et al. in [AKV04]. Kraj́ıček proved exponential lower bounds for a strong variant of this system using feasible interpolation [Kra07], and Tveretina et al. proved exponential lower bounds for restricted versions of this system for refuting formulas derived from the Pigeonhole Principle [TSZ1...
متن کاملLower bounds for a multi-skill project scheduling problem
This paper deals with an extension of the classical Resource Constrained Project Scheduling Problem (RCPSP). We present a new type of resource constraints in which staff members are involved. On the one hand, we focus on staff members, each of them having several skills, i.e, is able to perform more than one kind of activity. On the other hand, an activity has specific skill requirements that m...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research Letters
سال: 2018
ISSN: 0167-6377
DOI: 10.1016/j.orl.2018.11.003